A method for separating nearly multiple eigenvalues for Hermitian matrix
نویسندگان
چکیده
منابع مشابه
Computational Error Bounds for Multiple or Nearly Multiple Eigenvalues
In this paper bounds for clusters of eigenvalues of non-selfadjoint matrices are investigated. We describe a method for the computation of rigorous error bounds for multiple or nearly multiple eigenvalues, and for a basis of the corresponding invariant subspaces. The input matrix may be real or complex, dense or sparse. The method is based on a quadratically convergent Newton-like method; it in...
متن کاملPerturbation of Multiple Eigenvalues of Hermitian Matrices
This paper is concerned with the perturbation of a multiple eigenvalue μ of the Hermitian matrix A = diag(μI, A22) when it undergoes an off-diagonal Email addresses: [email protected] (Ren-Cang Li), [email protected] (Yuji Nakatsukasa), [email protected] (Ninoslav Truhar), [email protected] (Wei-guo Wang) Supported in part by National Science Foundation Grants DMS-0810506 and DMS1115...
متن کاملConstructing a Hermitian Matrix from Its Diagonal Entries and Eigenvalues
Given two vectors a; 2 Rn, the Schur-Horn theorem states that a majorizes if and only if there exists a Hermitian matrix H with eigenvalues and diagonal entries a. While the theory is regarded as classical by now, the known proof is not constructive. To construct a Hermitian matrix from its diagonal entries and eigenvalues therefore becomes an interesting and challenging inverse eigenvalue prob...
متن کاملNearly Optimal Preconditioned Methods for Hermitian Eigenproblems Under Limited Memory. Part II: Seeking Many Eigenvalues
In a recent companion paper, we proposed two methods, GD+k and JDQMR, as nearly optimal methods for finding one eigenpair of a real symmetric matrix. In this paper, we seek nearly optimal methods for a large number, nev, of eigenpairs that work with a search space whose size is O(1), independent from nev. The motivation is twofold: avoid the additional O(nevN) storage and the O(nevN) iteration ...
متن کاملA mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices
In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2007
ISSN: 0377-0427
DOI: 10.1016/j.cam.2005.08.040